|
In mathematics, Pépin's test is a primality test, which can be used to determine whether a Fermat number is prime. It is a variant of Proth's test. The test is named for a French mathematician, Théophile Pépin. ==Description of the test== Let be the ''n''th Fermat number. Pépin's test states that for ''n'' > 0, : is prime if and only if The expression can be evaluated modulo by repeated squaring. This makes the test a fast polynomial-time algorithm. However, Fermat numbers grow so rapidly that only a handful of Fermat numbers can be tested in a reasonable amount of time and space. Other bases may be used in place of 3, for example 5, 6, 7, or 10 . 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Pépin's test」の詳細全文を読む スポンサード リンク
|